Optimizing resource allocation for approximate real-time query processing
نویسندگان
چکیده
منابع مشابه
Optimizing resource allocation for approximate real-time query processing
Query optimization techniques are proved to be essential for high performance of database management systems. In the context of new querying paradigms, such as similarity based search, exact query evaluation is neither computationally feasible nor meaningful, and approximate query evaluation is the only reasonable option. In this paper a problem of resource allocation for approximate evaluation...
متن کاملAn Architecture for Approximate Real-Time Query Optimization and Processing
High-level declarative scripting languages are considered to be an effective tool for specification and execution of complex analytical data processing scenarios as they can hide the complexity of underlying heterogeneous processing environment. A growing demand to process huge amounts of data under real-time requirements as well as advanced similaritybased models raises the need in approximate...
متن کاملQuality based compute-resource allocation in real-time signal processing
We present a novel method for controlling the complexity of real-time signal processing computational tasks, in order to make sure that a total quality metric for all the signal processing tasks is maximized. The method makes decisions about how much compute power is allocated to each task through past observations of the input and output data of each task. We present preliminary results from f...
متن کاملReal-Time Hierarchical Resource Allocation
This paper presents a model that distinguishes between decentralized information processing and decentralized decision making in organizations; it shows that decentralized decision making can be advantageous due to computational delay, even in the absence of communication costs. The key feature of the model, which makes this result possible, is that decisions in a stochastic control problem are...
متن کاملReal-Time Resource Allocation for Tracking Systems
Automated tracking is key to many computer vision applications. However, many tracking systems struggle to perform in real-time due to the high computational cost of detecting people, especially in ultra high resolution images. We propose a new algorithm called PartiMax that greatly reduces this cost by applying the person detector only to the relevant parts of the image. PartiMax exploits info...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2014
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis120825063y